Sciweavers

401 search results - page 29 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
NIPS
2007
15 years 1 months ago
Selecting Observations against Adversarial Objectives
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
Andreas Krause, H. Brendan McMahan, Carlos Guestri...
BIRTHDAY
2003
Springer
15 years 5 months ago
Sweepline the Music!
Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
Esko Ukkonen, Kjell Lemström, Veli Mäkin...
HIPC
2000
Springer
15 years 3 months ago
Improving Offset Assignment on Embedded Processors Using Transformations
Embedded systems consisting of the application program ROM, RAM, the embedded processor core and any custom hardware on a single wafer are becoming increasingly common in areas suc...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 3 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
VMV
2000
146views Visualization» more  VMV 2000»
15 years 1 months ago
Matching 3D Freeform Shapes to Digitized Objects
In this paper the problem of matching freeform surface features against measured point data is studied. The motivation for this investigation is the recent demand for fast and rob...
Joris S. M. Vergeest, Sander Spanjaard, Jos J. O. ...