3281 search results - page 656 / 657 » Bases for parametrized iterativity |
107
click to vote
KDD
2012
ACM
12 years 12 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
SIGIR
2012
ACM
12 years 12 months ago
2012
ACM
Media studies concerns the study of production, content, and/or reception of various types of media. Today’s continuous production and storage of media is changing the way media...
SODA
2012
ACM
12 years 12 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
113
click to vote
ACNS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
84
Voted
ICCAD
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper presents several important enhancements to the recently published multilevel placement package mPL [12]. The improvements include (i) unconstrained quadratic relaxation...