Sciweavers

1859 search results - page 351 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
BMCBI
2006
192views more  BMCBI 2006»
15 years 2 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...
605
Voted

Lecture Notes
4961views
17 years 5 days ago
The Relational Data Model, Normalisation and effective Database Design
I have been designing and building applications, including the databases used by those applications, for several decades now. I have seen similar problems approached by different d...
Tony Marston
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 6 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
CGO
2004
IEEE
15 years 6 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...
165
Voted
CVPR
2010
IEEE
15 years 2 months ago
Label propagation in video sequences
This paper proposes a probabilistic graphical model for the problem of propagating labels in video sequences, also termed the label propagation problem. Given a limited amount of ...
Vijay Badrinarayanan, Fabio Galasso, Roberto Cipol...