Sciweavers

2715 search results - page 29 / 543
» An Implementation of Narrowing Strategies
Sort
View
ECCV
2002
Springer
14 years 10 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
UIST
1995
ACM
14 years 9 days ago
Multiple-View Approach for Smooth Information Retrieval
Although various visualization techniques have been proposed for information retrieval tasks, most of them are based on a single strategy for viewing and navigating through the in...
Toshiyuki Masui, Mitsuru Minakuchi, George R. Bord...
SPRINGSIM
2007
13 years 10 months ago
Bringing knowledge to network defense
Security managers must scan through multiple continuous data streams issuing from diverse sources in an effort to defend computer networks from attack. However, manual aggregation...
Leigh Flagg, Gordon Streeter, Andrew Potter
VLDB
2004
ACM
102views Database» more  VLDB 2004»
14 years 2 months ago
PIVOT and UNPIVOT: Optimization and Execution Strategies in an RDBMS
PIVOT and UNPIVOT, two operators on tabular data that exchange rows and columns, enable data transformations useful in data modeling, data analysis, and data presentation. They ca...
Conor Cunningham, Goetz Graefe, César A. Ga...
SIGECOM
2006
ACM
88views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Implementation with a bounded action space
While traditional mechanism design typically assumes isomorphism between the agents’ type- and action spaces, in many situations the agents face strict restrictions on their act...
Liad Blumrosen, Michal Feldman