Sciweavers

1390 search results - page 272 / 278
» Computing the depth of a flat
Sort
View
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 8 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
MOBIHOC
2005
ACM
14 years 8 months ago
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Recently, several studies have analyzed the statistical properties of low power wireless links in real environments, clearly demonstrating the differences between experimentally o...
Alberto Cerpa, Jennifer L. Wong, Miodrag Potkonjak...
SEMWEB
2009
Springer
14 years 3 months ago
Populating the Semantic Web by Macro-reading Internet Text
A key question regarding the future of the semantic web is “how will we acquire structured information to populate the semantic web on a vast scale?” One approach is to enter t...
Tom M. Mitchell, Justin Betteridge, Andrew Carlson...
IMC
2009
ACM
14 years 3 months ago
Network level footprints of facebook applications
With over half a billion users, Online Social Networks (OSNs) are the major new applications on the Internet. Little information is available on the network impact of OSNs, althou...
Atif Nazir, Saqib Raza, Dhruv Gupta, Chen-Nee Chua...
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 2 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm