Sciweavers

2944 search results - page 328 / 589
» Robust Semantic Construction
Sort
View
COMPGEOM
2004
ACM
16 years 3 days ago
Deterministic sampling and range counting in geometric data streams
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
Amitabha Bagchi, Amitabh Chaudhary, David Eppstein...
MMSEC
2004
ACM
133views Multimedia» more  MMSEC 2004»
16 years 3 days ago
Data hiding on 3D polygonal meshes
This paper presents a high-capacity method to embed information into the geometry of a 3D polygonal mesh. The method extends a previously reported work, to which several improveme...
Yannick Maret, Touradj Ebrahimi
GC
2004
Springer
16 years 2 days ago
A Framework for Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks have recently emerged as good candidate infrastructure for building novel large-scale and robust Internet applications in which participat...
Luc Onana Alima, Ali Ghodsi, Seif Haridi
ICA
2004
Springer
16 years 2 days ago
Blind Deconvolution Using the Relative Newton Method
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
Alexander M. Bronstein, Michael M. Bronstein, Mich...
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
16 years 1 days ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...