Sciweavers

70 search results - page 8 / 14
» The Ackermann Award 2007
Sort
View
MSOM
2010
65views more  MSOM 2010»
13 years 2 months ago
The Optimal Composition of Influenza Vaccines Subject to Random Production Yields
The Vaccine and Related Biologic Products Advisory Committee meets at least once a year to decide the composition of the influenza vaccine in the U.S. Past evidence suggests that ...
Soo-Haeng Cho
JGT
2007
85views more  JGT 2007»
13 years 7 months ago
On graphs with subgraphs having large independence numbers
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
Noga Alon, Benny Sudakov
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
14 years 1 months ago
Performance aware secure code partitioning
Many embedded applications exist where decisions are made using sensitive information. A critical issue in such applications is to ensure that data is accessed only by authorized ...
Sri Hari Krishna Narayanan, Mahmut T. Kandemir, Ri...
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
13 years 11 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
ACL
2007
13 years 8 months ago
A Seed-driven Bottom-up Machine Learning Framework for Extracting Relations of Various Complexity
A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as...
Feiyu Xu, Hans Uszkoreit, Hong Li