Sciweavers

4850 search results - page 655 / 970
» Approximate Data Structures with Applications
Sort
View
ICPR
2000
IEEE
16 years 7 months ago
Piecewise Linear Skeletonization Using Principal Curves
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
Adam Krzyzak, Balázs Kégl
CIKM
2008
Springer
15 years 8 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
WSCG
2003
166views more  WSCG 2003»
15 years 7 months ago
View-Dependent Multiresolution Model For Foliage
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...
Inmaculada Remolar, Miguel Chover, José Rib...
JMLR
2008
159views more  JMLR 2008»
15 years 6 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
CGO
2011
IEEE
14 years 10 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...