Sciweavers

9532 search results - page 1574 / 1907
» Logic, Graphs, and Algorithms
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 21 days ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
MM
2005
ACM
140views Multimedia» more  MM 2005»
16 years 9 days ago
Web image clustering by consistent utilization of visual features and surrounding texts
Image clustering, an important technology for image processing, has been actively researched for a long period of time. Especially in recent years, with the explosive growth of th...
Bin Gao, Tie-Yan Liu, Tao Qin, Xin Zheng, QianShen...
CIKM
2005
Springer
16 years 9 days ago
Concept-based interactive query expansion
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
Bruno M. Fonseca, Paulo Braz Golgher, Bruno P&ocir...
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
16 years 7 days ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
ISSTA
2004
ACM
16 years 5 days ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
« Prev « First page 1574 / 1907 Last » Next »