Sciweavers

4137 search results - page 298 / 828
» On the number of matchings of a tree
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
WG
2007
Springer
16 years 27 days ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
SKG
2006
IEEE
16 years 24 days ago
A Grid Service for Pattern Extraction from Mass Spectrometry Data
The paper presents a Grid Service allowing to detect and extract the longest common sub-spectrum among a set of mass spectrometry spectra data. The service is based on a novel pat...
Mario Cannataro, Pierangelo Veltri
MM
2005
ACM
103views Multimedia» more  MM 2005»
16 years 10 days ago
Diorama table
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...
Keiko Takahashi, Shinji Sasada
TAL
2004
Springer
16 years 4 days ago
Automatic Acquisition of Transfer Rules from Translation Examples
In our research, we have developed a transfer-based machine translation architecture for the translation from Japanese into German. One main feature of the system is the fully auto...
Werner Winiwarter