961 search results - page 126 / 193 » Significance-Driven Graph Clustering |
137
click to vote
NAACL
2007
15 years 5 months ago
2007
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
154
click to vote
SIAMDM
2008
15 years 4 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
148
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
140
click to vote
CSCW
2006
ACM
15 years 10 months ago
2006
ACM
The CSCW conference is celebrating its 20th birthday. This is a perfect time to analyze the coherence of the field, to examine whether it has a solid core or sub-communities, and ...
172
click to vote
SCOPES
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...