Sciweavers

1920 search results - page 266 / 384
» The Complexity of the A B C Problem
Sort
View
CASES
2005
ACM
13 years 11 months ago
Hardware support for code integrity in embedded processors
Computer security becomes increasingly important with continual growth of the number of interconnected computing platforms. Moreover, as capabilities of embedded processors increa...
Milena Milenkovic, Aleksandar Milenkovic, Emil Jov...
BMCBI
2005
158views more  BMCBI 2005»
13 years 8 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
ICDE
1998
IEEE
83views Database» more  ICDE 1998»
14 years 10 months ago
Grouping Techniques for Update Propagation in Intermittently Connected Databases
We consider an environment where one or more servers carry databases that are of interest to a community of clients. The clients are only intermittently connected to the server fo...
Sameer Mahajan, Michael J. Donahoo, Shamkant B. Na...
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
14 years 3 months ago
On Revenue Maximization in Second-Price Ad Auctions
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...
TCS
2008
13 years 8 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul