Sciweavers

2111 search results - page 174 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CIKM
2006
Springer
15 years 1 months ago
SaLSa: computing the skyline without scanning the whole sky
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 1 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
86
Voted
GISCIENCE
2008
Springer
141views GIS» more  GISCIENCE 2008»
14 years 11 months ago
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
Kai-Florian Richter, Matt Duckham
CG
2007
Springer
14 years 10 months ago
Visualizing and animating the winged-edge data structure
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
Bryan Neperud, John L. Lowther, Ching-Kuang Shene
CSCW
2010
ACM
15 years 7 months ago
Catchup: a useful application of time-travel in meetings
People are often required to catch up on information they have missed in meetings, because of lateness or scheduling conflicts. Catching up is a complex cognitive process where pe...
Simon Tucker, Ofer Bergman, Anand Ramamoorthy, Ste...