359 search results - page 65 / 72 » The Parameterized Complexity of Counting Problems |
PPL
2007
14 years 9 months ago
2007
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
189
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
100
click to vote
ISMB
2000
14 years 11 months ago
2000
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...
SIGMETRICS
2008
ACM
14 years 10 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
100
click to vote
KSEM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...