Sciweavers

247 search results - page 34 / 50
» Efficient natural evolution strategies
Sort
View
CGF
2010
98views more  CGF 2010»
14 years 9 months ago
Fast Generation of Pointerless Octree Duals
Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee dire...
Thomas Lewiner, Vinícius Mello, Adelailson ...
ICML
2006
IEEE
15 years 10 months ago
Learning to impersonate
Consider Alice, who is interacting with Bob. Alice and Bob have some shared secret which helps Alice identify Bob-impersonators. Now consider Eve, who knows Alice and Bob, but doe...
Moni Naor, Guy N. Rothblum
ADHOC
2004
118views more  ADHOC 2004»
14 years 9 months ago
A review of routing protocols for mobile ad hoc networks
The 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the dynamic nature of these networks demands new set of networking...
Mehran Abolhasan, Tadeusz A. Wysocki, Eryk Dutkiew...
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
15 years 3 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...
CVPR
2006
IEEE
15 years 11 months ago
A Design Principle for Coarse-to-Fine Classification
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
Sachin Gangaputra, Donald Geman