Sciweavers

2517 search results - page 75 / 504
» Specifying Weak Sets
Sort
View
AAAI
2008
15 years 2 months ago
Single Document Keyphrase Extraction Using Neighborhood Knowledge
Existing methods for single document keyphrase extraction usually make use of only the information contained in the specified document. This paper proposes to use a small number o...
Xiaojun Wan, Jianguo Xiao
IPCO
2010
184views Optimization» more  IPCO 2010»
15 years 1 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
CHI
2002
ACM
16 years 7 days ago
Interactive querying of time series data
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
Harry Hochheiser
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
14 years 10 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson
CONCUR
2008
Springer
15 years 1 months ago
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs
We present the tool Sycraft (SYmboliC synthesizeR and Adder of Fault-Tolerance). In Sycraft, a distributed fault-intolerant program is specified in terms of a set of processes and ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni