2693 search results - page 95 / 539 » On Computing Complex Navigation Functions |
175
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: A good scoring function is essential for molecular docking computations. In conventional scoring functions, energy terms modeling pairwise interactions are cumulativel...
183
click to vote
CGF
2005
15 years 6 months ago
2005
Current surface-based methods for interactive freeform editing of high resolution 3D models are very powerful, but at the same time require a certain minimum tessellation or sampl...
172
click to vote
APLAS
2004
ACM
15 years 11 months ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...
167
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
161
click to vote
TCS
2008
15 years 6 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...