Sciweavers

594 search results - page 118 / 119
» Using Approximation to Relate Computational Classes over the...
Sort
View
JCB
2002
70views more  JCB 2002»
13 years 7 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
BMCBI
2010
218views more  BMCBI 2010»
13 years 4 months ago
A hybrid blob-slice model for accurate and efficient detection of fluorescence labeled nuclei in 3D
Background: To exploit the flood of data from advances in high throughput imaging of optically sectioned nuclei, image analysis methods need to correctly detect thousands of nucle...
Anthony Santella, Zhuo Du, Sonja Nowotschin, Anna-...
ASPLOS
2008
ACM
13 years 9 months ago
Understanding and visualizing full systems with data flow tomography
It is not uncommon for modern systems to be composed of a variety of interacting services, running across multiple machines in such a way that most developers do not really unders...
Shashidhar Mysore, Bita Mazloom, Banit Agrawal, Ti...
PEPM
2009
ACM
14 years 4 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...
ATAL
2009
Springer
14 years 2 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...