Sciweavers

14518 search results - page 23 / 2904
» Two Problems for Sophistication
Sort
View
AINA
2008
IEEE
14 years 2 months ago
A Question Answering System for the Operation of Software Applications
Reflecting the rapid growth of information technology, the configuration of software applications, such as word processors and spreadsheets, is both sophisticated and complicate...
Atsushi Fujii, Seiji Takegata
ICWS
2010
IEEE
13 years 9 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 7 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
MOBIHOC
2008
ACM
14 years 7 months ago
On exploiting diversity and spatial reuse in relay-enabled wireless networks
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next gene...
Karthikeyan Sundaresan, Sampath Rangarajan
ICPR
2004
IEEE
14 years 8 months ago
Non-Isotropic Regularization of the Correspondence Space in Stereo-Vision
The correspondence problem in stereo vision is notoriously difficult. In many approaches a noisy solution is extracted from the correspondence space. Various sophisticated regular...
Nir A. Sochen, Rami Ben-Ari