1986 search results - page 300 / 398 » Path Separability of Graphs |
115
click to vote
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
Motivated to a large extent by the substantial and growing prominence of the World-Wide Web and the potential benefits that may be obtained by applying database concepts and tech...
111
Voted
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
108
Voted
DAS
2010
Springer
15 years 6 months ago
2010
Springer
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
113
Voted
AAAI
2007
15 years 4 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
146
click to vote
CCS
2008
ACM
15 years 4 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...