Sciweavers

897 search results - page 153 / 180
» Identity: How to name it, How to find it
Sort
View
CIE
2010
Springer
14 years 12 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
BMCBI
2008
102views more  BMCBI 2008»
14 years 12 months ago
Improving protein function prediction methods with integrated literature data
Background: Determining the function of uncharacterized proteins is a major challenge in the post-genomic era due to the problem's complexity and scale. Identifying a protein...
Aaron Gabow, Sonia M. Leach, William A. Baumgartne...
POPL
2009
ACM
16 years 12 days ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
16 years 4 days ago
Mission-Based Navigational Behaviour Modeling for Web Recommender Systems
Web recommender systems anticipate the information needs of on-line users and provide them with recommendations to facilitate and personalize their navigation. There are many appro...
Osmar R. Zaïane, Jia Li, Robert Hayward
ICALP
2009
Springer
16 years 1 days ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro