Sciweavers

999 search results - page 178 / 200
» Constraints in Non-Boolean Contexts
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
CHI
2007
ACM
15 years 10 months ago
Studying activity patterns in CSCW
We study small distributed work groups capturing, managing, and reusing knowledge in a collaborative activity. We conceive this process as adaptation of a group to an activity and...
Gregorio Convertino, Thomas P. Moran, Barton A. Sm...
95
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
107
Voted
ICDCS
2009
IEEE
15 years 6 months ago
REMO: Resource-Aware Application State Monitoring for Large-Scale Distributed Systems
To observe, analyze and control large scale distributed systems and the applications hosted on them, there is an increasing need to continuously monitor performance attributes of ...
Shicong Meng, Srinivas R. Kashyap, Chitra Venkatra...
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
Adding Depth to Cartoons Using Sparse Depth (In)equalities
This paper presents a novel interactive approach for adding depth information into hand-drawn cartoon images and animations. In comparison to previous depth assignment techniques ...
Daniel Sýkora, David Sedlacek, Sun Jinchao, John ...