Sciweavers

3143 search results - page 525 / 629
» Minimization of entropy functionals
Sort
View
CVPR
2010
IEEE
15 years 3 months ago
GPCA with denoising: A moments-based convex approach
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
Necmiye Ozay, Mario Sznaier, Constantino M. Lagoa,...
175
Voted
ECCV
2010
Springer
15 years 3 months ago
Superpixels and Supervoxels in an Energy Optimization Framework
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
Olga Veksler, Yuri Boykov, Paria Mehrani
158
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
Highly Memory-Efficient LogLog Hash for Deep Packet Inspection
As the network line rates reach 40 Gbps today and 100 Gbps in the near future, performing deep packet inspection (DPI) in the Network Intrusion Detection and Prevention Systems (NI...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
133
Voted
CN
2010
103views more  CN 2010»
15 years 3 months ago
Continuum equilibria and global optimization for routing in dense static ad hoc networks
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
109
Voted
CLASSIFICATION
2008
68views more  CLASSIFICATION 2008»
15 years 3 months ago
The Metric Cutpoint Partition Problem
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
Alain Hertz, Sacha Varone