2004 search results - page 225 / 401 » Sampling from large graphs |
119
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
112
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
162
Voted
KDD
2012
ACM
13 years 6 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...
165
Voted
SMC
2007
IEEE
15 years 9 months ago
2007
IEEE
—Digitization of production factors, including the knowledge for knowledge workers and consumers, opens almost infinite potential to connect persons, systems, processes, enterpri...
120
Voted
INTERNET
2007
15 years 3 months ago
2007
evel of abstraction, we can represent a workflow as a directed graph with operators (or tasks) at the vertices (see Figure 1). Each operator takes inputs from data sources or from ...