Sciweavers

195 search results - page 33 / 39
» Empirical Study of Object-Oriented Metrics
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 11 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
JMLR
2012
13 years 2 months ago
Active Clustering of Biological Sequences
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
GIS
2002
ACM
14 years 11 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
74
Voted
SIGSOFT
2005
ACM
16 years 13 days ago
Surveying the factors that influence maintainability: research design
We want to explore and analyse design decisions that influence maintainability of software. Software maintainability is important because the effort expended on changes and fixes ...
Wiebe Hordijk, Roel Wieringa
AINA
2007
IEEE
15 years 6 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein