Sciweavers

9842 search results - page 1311 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
FCS
2007
15 years 8 months ago
Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
J. Renze Steenhuisen, Cees Witteveen
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 8 months ago
A Compression Based Distance Measure for Texture
The analysis of texture is an important subroutine in application areas as diverse as biology, medicine, robotics, and forensic science. While the last three decades have seen ext...
Bilson J. L. Campana, Eamonn J. Keogh
HCI
2007
15 years 8 months ago
User Expectations from Dictation on Mobile Devices
Mobile phones, with their increasing processing power and memory, are enabling a diversity of tasks. The traditional text entry method using keypad is falling short in numerous way...
Santosh Basapur, Shuang Xu, Mark Ahlenius, Young S...
IIWAS
2007
15 years 8 months ago
User Data Privacy in Web Services Context Using Semantic Desktop - SemanticLIFE Case Study
The growing number of Web Services technologies and their use have revolutionized the web. Web Services will play an important role in the next web generation (i.e. Semantic Web) ...
Mansoor Ahmed, Amin Andjomshoaa, A. Min Tjoa
187
Voted
AAAI
2006
15 years 8 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
« Prev « First page 1311 / 1969 Last » Next »