Sciweavers

3600 search results - page 36 / 720
» The settling-time reducibility ordering
Sort
View
NETWORKS
2011
12 years 10 months ago
On terminal delta-wye reducibility of planar graphs
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
Isidoro Gitler, Feliu Sagols
ISSRE
2003
IEEE
14 years 27 days ago
Reducing wasted development time via continuous testing
Testing is often performed frequently during development to ensure software reliability by catching regression errors quickly. However, stopping frequently to test also wastes tim...
David Saff, Michael D. Ernst
SIGMOD
2011
ACM
210views Database» more  SIGMOD 2011»
12 years 10 months ago
A platform for scalable one-pass analytics using MapReduce
Today’s one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of data efficiently. MapReduce is a popular programm...
Boduo Li, Edward Mazur, Yanlei Diao, Andrew McGreg...
ACMACE
2008
ACM
13 years 9 months ago
Dimensionality reduced HRTFs: a comparative study
Dimensionality reduction is a statistical tool commonly used to map high-dimensional data into lower a dimensionality. The transformed data is typically more suitable for regressi...
Bill Kapralos, Nathan Mekuz, Agnieszka Kopinska, S...
ERCIMDL
2007
Springer
159views Education» more  ERCIMDL 2007»
14 years 1 months ago
Reducing Costs for Digitising Early Music with Dynamic Adaptation
Abstract. Optical music recognition (OMR) enables librarians to digitise early music sources on a large scale. The cost of expert human labour to correct automatic recognition erro...
Laurent Pugin, John Ashley Burgoyne, Ichiro Fujina...