Sciweavers

3244 search results - page 220 / 649
» On convex complexity measures
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Can developer-module networks predict failures?
Software teams should follow a well defined goal and keep their work focused. Work fragmentation is bad for efficiency and quality. In this paper we empirically investigate the re...
Martin Pinzger, Nachiappan Nagappan, Brendan Murph...
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 12 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
16 years 6 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
MM
2004
ACM
104views Multimedia» more  MM 2004»
15 years 12 months ago
A robust and accumulator-free ellipse hough transform
The ellipse Hough transform (EHT) is a widely-used technique. Most of the previous modifications to the standard EHT improved either the voting procedure that computes the absolut...
Xinguo Yu, Hon Wai Leong, Changsheng Xu, Qi Tian
APVIS
2006
15 years 8 months ago
Predicting graph reading performance: a cognitive approach
Performance and preference measures are commonly used in the assessment of visualization techniques. This is important and useful in understanding differences in effectiveness bet...
Weidong Huang, Seok-Hee Hong, Peter Eades