Sciweavers

417 search results - page 75 / 84
» In Search of the Best Constraint Satisfaction Search
Sort
View
ASSETS
2005
ACM
14 years 11 months ago
SmartColor: disambiguation framework for the colorblind
Failure in visual communication between the author and the colorblind reader is caused when color effects that the author expects for the reader to experience are not observed by...
Ken Wakita, Kenta Shimamura
96
Voted
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
15 years 10 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
86
Voted
AAAI
2000
14 years 11 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
15 years 3 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka