4343 search results - page 574 / 869 » Improving Visual Matching |
125
Voted
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Recent proposals to apply data mining systems to problems in law enforcement, national security, and fraud detection have attracted both media attention and technical critiques of...
149
click to vote
KDD
2002
ACM
16 years 3 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
140
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
111
click to vote
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
220
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...