Sciweavers

942 search results - page 182 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
FOCS
1998
IEEE
14 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ICML
2004
IEEE
14 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
KDD
2009
ACM
221views Data Mining» more  KDD 2009»
14 years 10 months ago
Migration motif: a spatial - temporal pattern mining approach for financial markets
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...
Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E. Lee,...