Sciweavers

4524 search results - page 117 / 905
» The Complexity of Global Constraints
Sort
View
130
Voted
P2P
2010
IEEE
207views Communications» more  P2P 2010»
14 years 11 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
16 years 1 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
93
Voted
CIKM
2009
Springer
15 years 7 months ago
Semi-nonnegative matrix factorization with global statistical consistency for collaborative filtering
Collaborative Filtering, considered by many researchers as the most important technique for information filtering, has been extensively studied by both academic and industrial co...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
AFRIGRAPH
2003
ACM
15 years 4 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
102
Voted
IJCAI
2003
15 years 2 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman