Sciweavers

11211 search results - page 2152 / 2243
» Rank-Sensitive Data Structures
Sort
View
187
Voted
POPL
2003
ACM
16 years 29 days ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
RECOMB
2006
Springer
16 years 29 days ago
Simulating Protein Motions with Rigidity Analysis
Abstract. Protein motions, ranging from molecular flexibility to largescale conformational change, play an essential role in many biochemical processes. Despite the explosion in ou...
Shawna L. Thomas, Xinyu Tang, Lydia Tapia, Nancy M...
111
Voted
CADE
2007
Springer
16 years 29 days ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
94
Voted
ICALP
2009
Springer
16 years 29 days ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
213
Voted
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 27 days ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
« Prev « First page 2152 / 2243 Last » Next »