Sciweavers

1257 search results - page 112 / 252
» A generalization of Euler's constant
Sort
View
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
14 years 4 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
MM
2009
ACM
195views Multimedia» more  MM 2009»
14 years 4 months ago
Flickr hypergroups
The amount of multimedia content available online constantly increases, and this leads to problems for users who search for content or similar communities. Users in Flickr often s...
Radu Andrei Negoescu, Brett Adams, Dinh Q. Phung, ...
DATE
2007
IEEE
85views Hardware» more  DATE 2007»
14 years 4 months ago
QuteSAT: a robust circuit-based SAT solver for complex circuit structure
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
Chi-An Wu, Ting-Hao Lin, Chih-Chun Lee, Chung-Yang...
ESWS
2007
Springer
14 years 4 months ago
Scalable Web Service Composition with Partial Matches
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
Adina Sirbu, Jörg Hoffmann
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden