Sciweavers

3105 search results - page 345 / 621
» The Path-Packing Structure of Graphs
Sort
View
182
Voted
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
15 years 10 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
SIGSOFT
2009
ACM
16 years 5 months ago
Improving bug triage with bug tossing graphs
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...
Gaeul Jeong, Sunghun Kim, Thomas Zimmermann
123
Voted
ICFP
2008
ACM
16 years 4 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig
FOCS
2009
IEEE
15 years 11 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
SENSYS
2005
ACM
15 years 10 months ago
TSAR: a two tier sensor storage architecture using interval skip graphs
Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems a...
Peter Desnoyers, Deepak Ganesan, Prashant J. Sheno...