Sciweavers

1162 search results - page 176 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
CIKM
2009
Springer
14 years 2 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
EMSOFT
2004
Springer
14 years 1 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 4 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...
ATAL
2010
Springer
13 years 9 months ago
Image based exploration for indoor environments using local features
d Abstract) Aravindhan K Krishnan Madhava Krishna Supreeth Achar This paper presents an approach to explore an unknown indoor environment using vision as the sensing modality, t...
Aravindhan K. Krishnan, K. Madhava Krishna, Supree...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 8 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...