Sciweavers

1566 search results - page 209 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
ALT
2007
Springer
14 years 4 months ago
Learning Kernel Perceptrons on Noisy Data Using Random Projections
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
Guillaume Stempfel, Liva Ralaivola
ICCV
2003
IEEE
14 years 9 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 8 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
JNW
2006
74views more  JNW 2006»
13 years 7 months ago
Mobility Resistant Clustering in Multi-Hop Wireless Networks
This paper presents a Distributed Efficient Clustering Approach (DECA) for mobility-resistant and energy-efficient clustering in multi-hop wireless networks. The clusterheads cover...
Miao Yu, Jason H. Li, Renato Levy
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 10 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou