Sciweavers

138 search results - page 19 / 28
» Finding Key Bloggers, One Post At A Time
Sort
View
CP
2009
Springer
14 years 8 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
ASYNC
2004
IEEE
98views Hardware» more  ASYNC 2004»
13 years 11 months ago
Synthesis of Speed Independent Circuits Based on Decomposition
This paper presents a decomposition method for speedindependent circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesi...
Tomohiro Yoneda, Hiroomi Onda, Chris J. Myers
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 9 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze

Publication
116views
13 years 7 months ago
Poking Facebook: Characterization of OSN Applications
Facebook is one of the most popular Internet sites today. A key fea- ture that arguably contributed to Facebook's unprecedented success is its application platform, which enab...
Minas Gjoka, Michael Sirivianos, Athina Markopoulo...
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...