Sciweavers

760 search results - page 120 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
13 years 9 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...
AAAI
2006
13 years 9 months ago
Identifying and Generating Easy Sets of Constraints for Clustering
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
Ian Davidson, S. S. Ravi
AIPS
2009
13 years 8 months ago
The Influence of k-Dependence on the Complexity of Planning
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
Omer Giménez, Anders Jonsson
SAC
2006
ACM
13 years 7 months ago
Undue influence: eliminating the impact of link plagiarism on web search rankings
Link farm spam and replicated pages can greatly deteriorate link-based ranking algorithms like HITS. In order to identify and neutralize link farm spam and replicated pages, we lo...
Baoning Wu, Brian D. Davison
KDD
2004
ACM
109views Data Mining» more  KDD 2004»
14 years 8 months ago
Identifying early buyers from purchase data
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
Paat Rusmevichientong, Shenghuo Zhu, David Selinge...