Sciweavers

3204 search results - page 509 / 641
» The Alcuin Number of a Graph
Sort
View
IS
2007
15 years 7 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
TMC
2008
104views more  TMC 2008»
15 years 7 months ago
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
GIS
2007
ACM
15 years 11 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
15 years 8 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 8 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani