Sciweavers

378 search results - page 16 / 76
» How Many Ways Can One Draw a Graph
Sort
View
140
Voted
JMLR
2006
124views more  JMLR 2006»
15 years 3 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
125
Voted
CONCUR
2006
Springer
15 years 7 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
130
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
CHI
2011
ACM
14 years 7 months ago
Utilizing multimedia capabilities of mobile phones to support teaching in schools in rural panama
Providing good education is one of the major challenges for humanity. In many developing regions in the world improving educational standards is seen as a central building block f...
Elba del Carmen Valderrama Bahamóndez, Chri...
128
Voted
ICPP
1999
IEEE
15 years 8 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward