Sciweavers

82 search results - page 16 / 17
» Efficient algorithms for finding critical subgraphs
Sort
View
AI
2010
Springer
13 years 2 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
BMCBI
2007
135views more  BMCBI 2007»
13 years 6 months ago
Measuring similarities between gene expression profiles through new data transformations
Background: Clustering methods are widely used on gene expression data to categorize genes with similar expression profiles. Finding an appropriate (dis)similarity measure is crit...
Kyungpil Kim, Shibo Zhang, Keni Jiang, Li Cai, In-...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 6 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
TASE
2010
IEEE
13 years 22 days ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang
ECCV
2002
Springer
14 years 7 months ago
Building Roadmaps of Local Minima of Visual Models
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
Cristian Sminchisescu, Bill Triggs