Sciweavers

1268 search results - page 23 / 254
» Finding a curve in a map
Sort
View
TC
2008
13 years 8 months ago
Efficient Approximate Wordlength Optimization
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
Paul D. Fiore
MOC
2000
87views more  MOC 2000»
13 years 8 months ago
Improving the parallelized Pollard lambda search on anomalous binary curves
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
Robert P. Gallant, Robert J. Lambert, Scott A. Van...
ML
2006
ACM
13 years 9 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
MICCAI
2006
Springer
14 years 10 months ago
Open-Curve Shape Correspondence Without Endpoint Correspondence
Abstract. Shape correspondence is the foundation for accurate statistical shape analysis; this is usually accomplished by identifying a set of sparsely sampled and well-corresponde...
Theodor Richardson, Song Wang
WMCSA
2003
IEEE
14 years 2 months ago
Proximity Mining: Finding Proximity using Sensor Data History
Emerging ubiquitous and pervasive computing applications often need to know where things are physically located. To meet this need, many locationsensing systems have been develope...
Toshihiro Takada, Satoshi Kurihara, Toshio Hirotsu...