Sciweavers

2576 search results - page 93 / 516
» The Complexity of Zero Knowledge
Sort
View
SMA
1997
ACM
120views Solid Modeling» more  SMA 1997»
15 years 8 months ago
The Generic Geometric Complex (GGC): A Modeling Scheme for Families of Decomposed Pointsets
: Modeling of families of geometric objects is a major topic in modern geometric and solid modeling. Object families are central to many important solid modeling applications, incl...
Ari Rappoport
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 8 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
CVPR
2005
IEEE
15 years 6 months ago
Database-Guided Segmentation of Anatomical Structures with Complex Appearance
The segmentation of anatomical structures has been traditionally formulated as a perceptual grouping task, and solved through clustering and variational approaches. However, such ...
Bogdan Georgescu, Xiang Sean Zhou, Dorin Comaniciu...
DEBS
2008
ACM
15 years 6 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
172
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano