Sciweavers

3838 search results - page 747 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
CORR
2010
Springer
171views Education» more  CORR 2010»
14 years 9 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé
JUCS
2008
130views more  JUCS 2008»
14 years 9 months ago
Feature Selection for the Classification of Large Document Collections
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
Janez Brank, Dunja Mladenic, Marko Grobelnik, Nata...
TSC
2008
209views more  TSC 2008»
14 years 9 months ago
Effective Web Service Composition in Diverse and Large-Scale Service Networks
Web services are considered to be a potential silver bullet for the envisioned Service Oriented Architecture, in which loosely coupled software components are published, located, a...
Seog-Chan Oh, Dongwon Lee, Soundar R. T. Kumara
IJCV
1998
233views more  IJCV 1998»
14 years 9 months ago
A Level-Set Approach to 3D Reconstruction from Range Data
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
Ross T. Whitaker
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
14 years 8 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...