Sciweavers

6274 search results - page 1087 / 1255
» From query complexity to computational complexity
Sort
View
SPAA
1997
ACM
15 years 9 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
119
Voted
CONEXT
2009
ACM
15 years 6 months ago
FairTorrent: bringing fairness to peer-to-peer systems
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
Alex Sherman, Jason Nieh, Clifford Stein
FSTTCS
2008
Springer
15 years 6 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
CGF
2006
191views more  CGF 2006»
15 years 5 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
CG
2004
Springer
15 years 4 months ago
3D video fragments: dynamic point samples for real-time free-viewpoint video
We present 3D video fragments, a dynamic point sample framework for real-time free-viewpoint video. By generalizing 2D video pixels towards 3D irregular point samples we combine t...
Stephan Würmlin, Edouard Lamboray, Markus H. ...
« Prev « First page 1087 / 1255 Last » Next »