Sciweavers

1933 search results - page 105 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
149
Voted
SUTC
2006
IEEE
15 years 9 months ago
Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data...
Kun-Feng Lin, Chuan-Ming Liu
122
Voted
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 8 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
127
Voted
ICCV
2011
IEEE
14 years 3 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
166
Voted
CORR
2004
Springer
124views Education» more  CORR 2004»
15 years 3 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
149
Voted
DAC
1989
ACM
15 years 7 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong