68 search results - page 13 / 14 » Computing Graph Roots Without Short Cycles |
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
VLSID
2008
IEEE
14 years 6 months ago
2008
IEEE
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
VLSID
2001
IEEE
14 years 6 months ago
2001
IEEE
Networking hardware manufacturers face the dual demands of supporting ever increasing bandwidth requirements, while also delivering new features, such as the ability to implement ...
HRI
2006
ACM
14 years 7 days ago
2006
ACM
The design and development of social robots that interact and assist people in daily life requires moving into unconstrained daily-life environments. This presents unexplored meth...
COMPGEOM
2005
ACM
13 years 8 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...