Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yiming Ye

dblp:67/333 · DBLP profile ↗
← Back
13ranked-venue papers
9as first author
1since 2021 · last 2026
0000-0001-7737-6100ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 7 first-authorDatabases, data management, data science and information retrieval · 3 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 61% Network security · 30% Authentication and access control · 9%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › attack strategy
collusion attack
0.012003
Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy · IEEE Trans. Knowl. Data Eng. 2003
Cryptographic protocols and secure computation › key management
key assignment
0.012003
Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy · IEEE Trans. Knowl. Data Eng. 2003
Cryptographic protocols and secure computation › key management › key assignment › hierarchical key assignment
time-bound hierarchical key assignment
0.012003
Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy · IEEE Trans. Knowl. Data Eng. 2003
Algorithmic game theory and mechanism design
coalition formation
0.012003
Dynamics of Coalition Formation in Combinatorial Trading · IJCAI 2003
Authentication and access control › access control › role-based access control
hierarchical access control
0.012003
Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy · IEEE Trans. Knowl. Data Eng. 2003

Methods — techniques the papers use, named apart from their topics

cryptanalysis · 0.0
YearPublicationVenuePosition
2026 Unified patch-wise spatial-temporal graph framework for dynamic and continuous interaction modeling in pedestrian trajectory prediction
Fei Hui, Yiming Ye, Xiangmo Zhao, Zhiwen Tong
Adv. Eng. Informatics3
2004 Usage Scenarios and Goals for Ontology Definition Metamodel
Lewis Hart, Patrick Emery, Robert M. Colomb, Kerry Raymond, Dan Chang, Yiming Ye, Elisa F. Kendall, Mark Dutra
WISE6
2003 Dynamics of Coalition Formation in Combinatorial Trading
Yiming Ye, Yuhai Tu
IJCAI1
2003 Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy
abstract
Tzeng (2002) proposed a time-bound cryptographic key assignment scheme for access control in a partial-order hierarchy. In this paper, we show that Tzeng's scheme is insecure against the collusion attack whereby three users conspire to access some secret class keys that they should not know according to Tzeng's scheme.
Xun Yi, Yiming Ye
IEEE Trans. Knowl. Data Eng.2
2003 Performance and attention in multiagent object search team
abstract
A well-designed cooperation strategy for a task oriented multiagent team is important as it can improve performance. A challenging research issue in cooperation concerns the extent to which an agent should pay attention to the actions and effects of other agents. In this paper, we address this issue in the context of an object search team. We first propose the concept of an activity window which captures an agent's view of the activities and effects of the team. Then we pinpoint some criteria that can be used to determine whether it is beneficial for an agent to put an action of the team into its window. Finally, we present experimental results to test these criteria.
Yiming Ye, Xun Yi, Juhnyoung Lee
IEEE Trans. Syst. Man Cybern. Part A1
2003 A secure conference scheme for mobile communications
abstract
A growing application area in mobile communications is mobile teleconference in which a group of mobile users collaborate in an interactive procedure, such as a board meeting, a task force, a scientific discussion, or even a virtual classroom. Wireless communications transmit conversations via radio, making them more susceptible to eavesdropping and unauthorized access than are conversations carried via wires. Therefore, it is crucial to ensure confidentiality and authenticity in a mobile teleconference. The authors design a new secure conference scheme for mobile communications. Based on a modular square root technique, this scheme is secure against eavesdropping, impersonating, and tracking attacks and allows a participant to join or quit a mobile teleconference dynamically.
Xun Yi, Chee Kheong Siew, Chik How Tan, Yiming Ye
IEEE Trans. Wirel. Commun.4
2003 Smart distance principle for "sense and respond" enterprise systems
Yiming Ye, Prabir Nandi, Jun-Jang Jeng, Santhosh Kumaran
Web Intell. Agent Syst.1
2001 A Complexity-Level Analysis of the Sensor Planning Task for Object Search
abstract
Object search is the task of searching for a given 3D object in a given 3D environment by a controllable camera. Sensor planning for object search refers to the task of how to select the sensing parameters of the camera so as to bring the target into the field of view of the camera and to make the image of the target to be easily recognized by the available recognition algorithms. In this paper, we study the task of sensor planning for object search from the theoretical point of view. We formulate the task and point out many of its important properties. We then analyze this task from the complexity level and prove that this task is NP‐Complete.
Yiming Ye, John K. Tsotsos
Comput. Intell.1
2001 Knowledge Granularity Spectrum, Action Pyramid, and the Scaling Problem
abstract
In this paper we introduce the concept of knowledge granularity and study the relationship between different knowledge representation schemes and the scaling problem. By scale to a task, we mean that an agent's planning system and knowledge representation scheme are able to generate the range of behaviors required by the task in a timely fashion. Action selection is critical to an agent performing a task in a dynamic, unpredictable environment. Knowledge representation is central to the agent's action selection process. It is important to study how an agent should adapt its methods of representation such that its performance can scale to different task requirements. Here we study the following issues. One is the knowledge granularity problem: to what detail should an agent represent a certain kind of knowledge if a single granularity of representation is to be used. Another is the representation scheme problem: to scale to a given task, should an agent represent its knowledge using a single granularity or a set of hierarchical granularities.
Yiming Ye, John K. Tsotsos
Int. J. Pattern Recognit. Artif. Intell.1
2001 Agents-supported adaptive group awareness: smart distance and WWWaware
abstract
We study how agents can facilitate and mediate interaction, communication, and cooperation among people. We propose the concepts of a smart distance and an awareness network in a distributed collaborative environment. We illustrate the architecture of an agent-mediated collaborative system - the agent-buddy system that can create a sense of group presence and, at the same time, preserve the privacy of each user. Virtual springs systems are used to model the awareness degrees among team members. Each agent makes decisions by considering multiple factors. The goal of the multi-agent team is to minimize the global awareness frustrations with respect to different kinds of tasks. Empirical studies were conducted to analyze the influence of individual behavior on global performance for various kinds of tasks.
Yiming Ye, Stephen J. Boies, P. Y. Huang, John K. Tsotsos
IEEE Trans. Syst. Man Cybern. Part A1
2000 Tracking a person with pre-recorded image database and a pan, tilt, and zoom camera
Yiming Ye, John K. Tsotsos, Eric Harley, Karen Bennet
Mach. Vis. Appl.1
1999 Sensor Planning for 3D Object Search,
Yiming Ye, John K. Tsotsos
Comput. Vis. Image Underst.1
1998 Tracking a Person with Pre-recorded Image Database and a Pan, Tilt, and Zoom Camera
Yiming Ye, John K. Tsotsos, Karen Bennet, Eric Harley
ACCV (2)1