3280 search results - page 301 / 656 » MiTAP for real users, real data, real problems |
185
click to vote
WEA
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
274
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
136
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
357
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
187
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...