Sciweavers

2080 search results - page 255 / 416
» Measuring empirical computational complexity
Sort
View
COMPGEOM
2003
ACM
15 years 11 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
FOCS
2002
IEEE
15 years 11 months ago
Auctions with Severely Bounded Communication
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
Liad Blumrosen, Noam Nisan
ISCC
2002
IEEE
289views Communications» more  ISCC 2002»
15 years 11 months ago
Comparison of voice activity detection algorithms for VoIP
We discuss techniques for Voice Activity Detection (VAD) for Voice over Internet Protocol (VoIP). VAD aids in saving bandwidth requirement of a voice session thereby increasing th...
R. Venkatesha Prasad, Abhijeet Sangwan, H. S. Jama...
PAKDD
2010
ACM
178views Data Mining» more  PAKDD 2010»
15 years 10 months ago
SkyDist: Data Mining on Skyline Objects
The skyline operator is a well established database primitive which is traditionally applied in a way that only a single skyline is computed. In this paper we use multiple skylines...
Christian Böhm, Annahita Oswald, Claudia Plan...
CG
1998
Springer
15 years 10 months ago
Relevance Cuts: Localizing the Search
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
Andreas Junghanns, Jonathan Schaeffer