Sciweavers

2834 search results - page 439 / 567
» Representing Trees with Constraints
Sort
View
96
Voted
FLAIRS
2009
14 years 10 months ago
Analyzing Team Actions with Cascading HMM
While team action recognition has a relatively extended literature, less attention has been given to the detailed realtime analysis of the internal structure of the team actions. ...
Brandyn Allen White, Nate Blaylock, Ladislau B&oum...
129
Voted
BMCBI
2011
14 years 7 months ago
iPhy: an integrated phylogenetic workbench for supermatrix analyses
Background: The increasing availability of molecular sequence data means that the accuracy of future phylogenetic studies is likely to by limited by systematic bias and taxon choi...
Martin O. Jones, Georgios D. Koutsovoulos, Mark L....
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 4 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
132
Voted
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
15 years 7 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
82
Voted
RIDE
2002
IEEE
15 years 5 months ago
A Scheme for Integrating e-Services in Establishing Virtual Enterprises
An important aspect of Business to Business ECommerce is the agile Virtual Enterprise (VE). VEs are established when existing enterprises dynamically form temporary alliances, joi...
Alan Berfield, Panos K. Chrysanthis, Ioannis Tsama...