Sciweavers

395 search results - page 41 / 79
» Towards a theory of search queries
Sort
View
BMCBI
2002
109views more  BMCBI 2002»
13 years 8 months ago
Kangaroo - A pattern-matching program for biological sequences
Background: Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do no...
Doron Betel, Christopher W. V. Hogue
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 9 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
DOCENG
2003
ACM
14 years 2 months ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
Jean-Yves Vion-Dury
WWW
2007
ACM
14 years 9 months ago
Extending WebML towards semantic web
Available methodologies for developing Sematic Web applications do not fully exploit the whole potential deriving from interaction with ontological data sources. Here we introduce...
Federico Michele Facca, Marco Brambilla
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
14 years 26 days ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei