2304 search results - page 86 / 461 » On the Vulnerability of Large Graphs |
102
click to vote
HEURISTICS
2010
14 years 8 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
100
click to vote
3DPVT
2006
IEEE
15 years 7 months ago
2006
IEEE
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
124
click to vote
SEMWEB
2005
Springer
15 years 7 months ago
2005
Springer
In many practical applications, ontologies tend to be very large and complicated. In order for users to quickly understand and analyze large-scale ontologies, in this paper we prop...
134
click to vote
GI
1997
Springer
15 years 5 months ago
1997
Springer
This paper gives an overview of an architecture and search organization for large vocabulary, continuous speech recognition (LVCSR at RWTH). In the rst part of the paper, we descri...
127
click to vote
DAWAK
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...