Sciweavers

305 search results - page 45 / 61
» Using Answer Sets to Solve Belief Change Problems
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
Resource Allocation over Network Dynamics without Timescale Separation
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
Alexandre Proutiere, Yung Yi, Tian Lan, Mung Chian...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 6 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
ACML
2009
Springer
15 years 6 months ago
Coupled Metric Learning for Face Recognition with Degraded Images
Real-world face recognition systems are sometimes confronted with degraded face images, e.g., low-resolution, blurred, and noisy ones. Traditional two-step methods have limited per...
Bo Li, Hong Chang, Shiguang Shan, Xilin Chen
JAR
2000
123views more  JAR 2000»
14 years 11 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
90
Voted
BMCBI
2008
211views more  BMCBI 2008»
14 years 12 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen