Sciweavers

5210 search results - page 234 / 1042
» Exact geometric computation
Sort
View
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 8 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICPR
2004
IEEE
16 years 7 months ago
Efficient Model Selection for Kernel Logistic Regression
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...
Gavin C. Cawley, Nicola L. C. Talbot
DCC
2006
IEEE
16 years 6 months ago
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
Wilfried Meidl, Arne Winterhof
DGCI
2005
Springer
16 years 4 days ago
Reversible Polygonalization of a 3D Planar Discrete Curve: Application on Discrete Surfaces
Abstract. Reversible polyhedral modelling of discrete objects is an important issue to handle those objects. We propose a new algorithm to compute a polygonal face from a discrete ...
Isabelle Sivignon, Florent Dupont, Jean-Marc Chass...
ARITH
2003
IEEE
15 years 12 months ago
Saturating Counters: Application and Design Alternatives
We define a new class of parallel counters, Saturating Counters, which provide the exact count of the inputs that are 1 only if this count is below a given threshold. Such counte...
Israel Koren, Yaron Koren, Bejoy G. Oomman