Sciweavers

3946 search results - page 614 / 790
» The computational complexity of choice sets
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Detecting texts of arbitrary orientations in natural images
With the increasing popularity of practical vision systems and smart phones, text detection in natural scenes becomes a critical yet challenging task. Most existing methods have f...
Cong Yao, Xiang Bai, Wenyu Liu, Yi Ma, Zhuowen Tu
TSE
2012
13 years 9 months ago
Automated Abstractions for Contract Validation
d Abstractions for Contract Validation Guido de Caso, Víctor Braberman, Diego Garbervetsky and Sebastián Uchitel —Pre/post condition-based specifications are common-place in a...
Guido de Caso, Víctor A. Braberman, Diego G...
TKDE
2012
250views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
CVPR
2010
IEEE
16 years 2 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
SIGCOMM
2009
ACM
16 years 1 months ago
Modeling and understanding end-to-end class of service policies in operational networks
Business and economic considerations are driving the extensive use of service differentiation in Virtual Private Networks (VPNs) operated for business enterprises today. The resul...
Yu-Wei Eric Sung, Carsten Lund, Mark Lyn, Sanjay G...