Sciweavers

324 search results - page 61 / 65
» Bounds for Functions of Dependent Risks
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
ICCV
2009
IEEE
15 years 10 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
ICML
2007
IEEE
14 years 8 months ago
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...
Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro
POPL
2008
ACM
14 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
VLDB
2007
ACM
141views Database» more  VLDB 2007»
14 years 7 months ago
Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianc...