Sciweavers

243 search results - page 29 / 49
» Small Is Not Always Beautiful
Sort
View
CCCG
1998
13 years 9 months ago
A modified longest side bisection triangulation
Fast and efficient exploration of large terrains in a virtual reality manner requires different levels of detail to speedup processing of terrain parts in background. Thus, the tr...
Christoph Stamm, Stephan Eidenbenz, Renato Pajarol...
COR
2008
111views more  COR 2008»
13 years 8 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
JMLR
2006
125views more  JMLR 2006»
13 years 7 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
JMM2
2006
133views more  JMM2 2006»
13 years 7 months ago
An Adaptive Method for Image Recovery in the DFT Domain
In image authentication research, a common approach is to divide a given image into a number of smaller blocks, and embed a fragile watermark into each block. The modifications can...
Peining Tao, Ahmet M. Eskicioglu
IPM
2007
123views more  IPM 2007»
13 years 7 months ago
Using query logs to establish vocabularies in distributed information retrieval
Users of search engines express their needs as queries, typically consisting of a small number of terms. The resulting search engine query logs are valuable resources that can be ...
Milad Shokouhi, Justin Zobel, Seyed M. M. Tahaghog...