Sciweavers

905 search results - page 101 / 181
» On the Complexity of uSPR Distance
Sort
View
RECOMB
2009
Springer
15 years 10 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
15 years 10 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
STACS
2010
Springer
15 years 4 months ago
Quantum Algorithms for Testing Properties of Distributions
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hass...
COMPLEX
2009
Springer
15 years 4 months ago
Retail Location Choice with Complementary Goods: An Agent-Based Model
This paper examines the emergence of retail clusters on a supply chain network comprised of suppliers, retailers, and consumers. An agent-based model is proposed to investigate ret...
Arthur Huang, David Levinson
MDM
2009
Springer
123views Communications» more  MDM 2009»
15 years 4 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...