Sciweavers

1431 search results - page 170 / 287
» The complexity of random ordered structures
Sort
View
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 7 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
139
Voted
CVIU
2004
143views more  CVIU 2004»
15 years 3 months ago
Shape matching of partially occluded curves invariant under projective transformation
This paper describes a method to identify partially occluded shapes which are randomly oriented in 3D space. The goal is to match the object contour present in an image with an ob...
Carlos Orrite, José Elías Herrero Ja...
149
Voted
ICWS
2010
IEEE
15 years 1 months ago
An Approach for Mining Web Service Composition Patterns from Execution Logs
A service-oriented application is composed of multiple web services to fulfill complex functionality that cannot be provided by individual web service. The combination of services ...
Ran Tang, Ying Zou
CORR
2010
Springer
67views Education» more  CORR 2010»
15 years 25 days ago
Secret Sharing LDPC Codes for the Constrained Gaussian Wiretap Channel
The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presenc...
Chan Wong Wong, Tan F. Wong, John M. Shea
134
Voted
TCOM
2010
83views more  TCOM 2010»
14 years 10 months ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...