Sciweavers

2004 search results - page 360 / 401
» Sampling from large graphs
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 3 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
VLDB
2004
ACM
100views Database» more  VLDB 2004»
14 years 3 months ago
Resilient Rights Protection for Sensor Streams
Today’s world of increasingly dynamic computing environments naturally results in more and more data being available as fast streams. Applications such as stock market analysis,...
Radu Sion, Mikhail J. Atallah, Sunil Prabhakar
COMPGEOM
2008
ACM
13 years 11 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
ESANN
2006
13 years 11 months ago
Margin based Active Learning for LVQ Networks
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples during the model adaptation...
Frank-Michael Schleif, Barbara Hammer, Thomas Vill...
IJCAI
2003
13 years 11 months ago
Use of Off-line Dynamic Programming for Efficient Image Interpretation
An interpretation system finds the likely mappings from portions of an image to real-world objects. An interpretation policy specifies when to apply which imaging operator, to whi...
Ramana Isukapalli, Russell Greiner