Sciweavers

7773 search results - page 211 / 1555
» On generalized Frame-Stewart numbers
Sort
View
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 6 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
LCTRTS
2010
Springer
16 years 1 months ago
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
Minming Li, Chun Jason Xue, Tiantian Liu, Yingchao...
ACSC
2009
IEEE
16 years 1 months ago
ALARM: An Adaptive Load-Aware Routing Metric for Hybrid Wireless Mesh Networks
Abstract— Hybrid Wireless Mesh Networks (WMN) are generally employed to establish communication during disaster recovery operations. The Hybrid WMN network is formed in a spontan...
Asad Amir Pirzada, Ryan Wishart, Marius Portmann, ...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
16 years 1 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
SPAA
2004
ACM
15 years 12 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter