Sciweavers

1061 search results - page 73 / 213
» Natural Selection in Relation to Complexity
Sort
View
ICSM
2009
IEEE
14 years 3 months ago
The end-to-end use of source code examples: An exploratory study
This appendix contains the details of our case studies out­ lined in our paper for the 2009 International Conference on Software Maintenance, as well as an expanded discussion se...
Reid Holmes, Rylan Cottrell, Robert J. Walker, J&o...
EUROPAR
2007
Springer
14 years 3 months ago
Content-Based Publish/Subscribe Using Distributed R-Trees
Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network...
Silvia Bianchi, Pascal Felber, Maria Gradinariu
DEXAW
2000
IEEE
165views Database» more  DEXAW 2000»
14 years 1 months ago
Summarizing Video Datasets in the Spatiotemporal Domain
In this paper we address the problem of analyzing and managing complex dynamic scenes captured in video. We present an approach to summarize video datasets by analyzing the trajec...
Anthony Stefanidis, Panos Partsinevelos, Peggy Ago...
PVLDB
2008
122views more  PVLDB 2008»
13 years 8 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
TNN
2010
176views Management» more  TNN 2010»
13 years 3 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao