Sciweavers

207 search results - page 17 / 42
» Convexity of the Proximal Average
Sort
View
BVAI
2005
Springer
14 years 29 days ago
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
Giuseppe Papari, Nicolai Petkov
WWW
2007
ACM
14 years 8 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
WWW
2006
ACM
14 years 8 months ago
Topic-oriented query expansion for web search
The contribution of this paper includes three folders: (1) To introduce a topic-oriented query expansion model based on the Information Bottleneck theory that classify terms into ...
Shao-Chi Wang, Yuzuru Tanaka
ICASSP
2010
IEEE
13 years 7 months ago
Stochastic cross-layer resource allocation for wireless networks using orthogonal access: Optimality and delay analysis
Efficient design of wireless networks requires implementation of cross-layer algorithms that exploit channel state information. Capitalizing on convex optimization and stochastic...
Antonio G. Marqués, Georgios B. Giannakis, ...
ICCAD
2002
IEEE
149views Hardware» more  ICCAD 2002»
14 years 4 months ago
Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step
─ In this paper, we present Forge, an optimal algorithm for gate sizing using the Elmore delay model. The algorithm utilizes Lagrangian relaxation with a fast gradient-based pre-...
Hiran Tennakoon, Carl Sechen